

lst = [90, 89, 79, 68, 99, 82, 78, 53]

def merge_sort(lst):
    if len(lst)>1:
        a=len(lst)//2
        more = merge_sort(lst[a:])
        less = merge_sort(lst[:a])
        return merge(more, less)
    else:
        return lst
def merge(lst1,lst2):
    lst=[]
    while len(lst1)>0 and len(lst2)>0:
        if lst1[0]>lst2[0]:
            lst.append(lst2.pop(0))
        else:
            lst.append(lst1.pop(0))
    if lst1:
        lst+=lst1
    if lst2:
        lst+=lst2
    return lst
print(merge_sort(lst))